Context-Aware Nearest Neighbor Query on Social Networks
نویسندگان
چکیده
منابع مشابه
Non-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملLocation Privacy-Aware Nearest-Neighbor Query with Complex Cloaked Regions
The development of location-based services has spread over many aspects of modern social life. This development brings not only conveniences to users’ daily life but also great concerns about users’ location privacy. In such services, location privacy aware query processing that handles cloaked regions is becoming an essential part in preserving user privacy. However, the state-of-the-art cloak...
متن کاملQuery-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search
Locality-Sensitive Hashing (LSH) and its variants are the well-known indexing schemes for the c-Approximate Nearest Neighbor (c-ANN) search problem in high-dimensional Euclidean space. Traditionally, LSH functions are constructed in a query-oblivious manner in the sense that buckets are partitioned before any query arrives. However, objects closer to a query may be partitioned into different bu...
متن کاملPrivacy Aware Spatial Queries
The advancement in mobile communications and its integration with Geographical Information System result in tremendous increase in Location aware computing. Users thirst for Geo-Point of interest leads to exploration of different classes of spatial queries like nearest neighbor, range queries etc in location based computing. Each query type is unique and there is no frame work to combine these ...
متن کاملk-NN Multimedia Retrieval in Unstructured Peer-to-Peer Networks
AbstractRecent years saw the rapid development of peer-to-peer (P2P) networks in a great variety of applications. However, similarity-based k-nearest-neighbor retrieval (k-NN) is still a challenging task in P2P networks due to the multiple constraints such as the dynamic topology and the unpredictable data updates. Caching is an attractive solution that reduces network traffic and hence could r...
متن کامل